Chu’s Construction: a Proof-theoretic Approach
نویسنده
چکیده
The essential interaction between classical and intuitionistic features in the system of linear logic is best described in the language of category theory. Given a symmetric monoidal closed category with products, the category can be given the structure of a *-autonomous category by a special case of the Chu construction. The main result of the paper is to show that the intuitionistic translations induced by Girard’s trips determine the functor from the free *-autonomous category on a set of atoms to where is the free monoidal closed category with products and coproducts on the set of atoms (a pair in for each atom P of 0.
منابع مشابه
On the π-calculus and Co-intuitionistic Logic. Notes on Logic for Concurrency and λP Systems
We reconsider work by Bellin and Scott in the 1990s on R. Milner and S. Abramsky’s encoding of linear logic in the π-calculus and give an account of efforts to establish a tight connection between the structure of proofs and of the cut elimination process in multiplicative linear logic, on one hand, and the input-output behaviour of the processes that represent them, on the other, resulting in ...
متن کاملMODULARITY OF AJMAL FOR THE LATTICES OF FUZZY IDEALS OF A RING
In this paper, we construct two fuzzy sets using the notions of level subsets and strong level subsets of a given fuzzy set in a ring R. These fuzzy sets turn out to be identical and provide a universal construction of a fuzzy ideal generated by a given fuzzy set in a ring. Using this construction and employing the technique of strong level subsets, we provide the shortest and direct fuzzy set ...
متن کاملA Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus
A graph-theoretic construction for representing the derivational side-conditions in the construction of axiomatic linkages for Lambek proof nets is presented, along with a naive algorithm that applies it to the sequent derivability problem for the Lambek Calculus. Some basic properties of this construction are also presented, and some complexity issues related to parsing with Lambek Categorial ...
متن کاملOrdinals and interactive programs
The work reported in this thesis arises from the old idea, going back to the origins of constructive logic, that a proof is fundamentally a kind of program. If proofs can be considered as programs, then one might expect that proof theory should have much to contribute to the theory of programming. This has indeed turned out to be the case. Various technologies developed in proof theory are now ...
متن کاملAn Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming
In this thesis we compose a proof-theoretic approach to logic programming with a category-theoretic approach to proof theory. This allows us to present the computation mechanisms of several systems of logic programming as proof search strategies within an intuitionistic first-order sequent calculus with logic variables and to analyze aspects of their behavior algebraically. Beginning from the b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999